Local-world evolving networks with tunable clustering
نویسندگان
چکیده
We propose an extended local-world evolving network model including a triad formation step. In the process of network evolution, random fluctuation in the number of new edges is involved. We derive analytical expressions for degree distribution, clustering coefficient and average path length. Our model can unify the generic properties of real-life networks: scale-free degree distribution, high clustering and small inter-node separation. Moreover, in our model, the clustering coefficient is tunable simply by changing the expected number of triad formation steps after a single local preferential attachment step.
منابع مشابه
The weighted tunable clustering in local-world networks with incremental behaviors
Since some realistic networks are influenced not only by increment behavior but also by tunable clustering mechanism with new nodes to be added to networks, it is interesting to characterize the model for those actual networks. In this paper, a weighted local-world model, which incorporates increment behavior and tunable clustering mechanism, is proposed and its properties are investigated, suc...
متن کاملAn Evolving Network Model With Local-World Structure∗
In this paper, a new local-world evolving network model including triad formation mechanism is proposed and studied. Analytical expressions for degree distribution and clustering coefficient are derived using continuum theory. It is shown that the degree distribution transfers from exponential to power-law scaling, and the clustering coefficient is tunable with known parameters. Finally, the nu...
متن کاملA Synthetical Weights’ Dynamic Mechanism for Weighted Networks
We propose a synthetical weights’ dynamic mechanism for weighted networks which takes into account the influences of strengths of nodes, weights of links and incoming new vertices. Strength/Weight preferential strategies are used in these weights’ dynamic mechanisms, which depict the evolving strategies of many real-world networks. We give insight analysis to the synthetical weights’ dynamic me...
متن کاملGrowing scale-free small-world networks with tunable assortative coefficient
In this paper, we propose a simple rule that generates scale-free small-world networks with tunable assortative coefficient. These networks are constructed by two-stage adding process for each new node. The model can reproduce scale-free degree distributions and small-world effect. The simulation results are consistent with the theoretical predictions approximately. Interestingly, we obtain the...
متن کاملA model for generating tunable clustering coefficients independent of the number of nodes in scale free and random networks
Probabilistic networks display a wide range of high average clustering coefficients independent of the number of nodes in the network. In particular, the local clustering coefficient decreases with the degree of the subtending node in a complicated manner not explained by any current models. While a number of hypotheses have been proposed to explain some of these observed properties, there are ...
متن کامل